A note on Fiedler vectors interpreted as graph realizations
نویسندگان
چکیده
The second smallest eigenvalue of the Laplace matrix of a graph and its eigenvectors, also known as Fiedler vectors in spectral graph partitioning, carry significant structural information regarding the connectivity of the graph. Using semidefinite programming duality we offer a geometric interpretation of this eigenspace as optimal solution to a graph realization problem. A corresponding interpretation is also given for the eigenspace of the maximum eigenvalue of the Laplacian.
منابع مشابه
Fiedler Vectors and Elongation of Graphs: A Threshold Phenomenon on a Particular Class of Trees
Let G be a graph. Its laplacian matrix L(G) is positive and we consider eigenvectors of its first non-null eigenvalue that are called Fiedler vector. They have been intensively used in spectral partitioning problems due to their good empirical properties. More recently Fiedler vectors have been also popularized in the computer graphics community to describe elongation of shapes. In more technic...
متن کاملInvertibility of graph translation and support of Laplacian Fiedler vectors
The graph Laplacian operator is widely studied in spectral graph theory largely due to its importance in modern data analysis. Recently, the Fourier transform and other time-frequency operators have been defined on graphs using Laplacian eigenvalues and eigenvectors. We extend these results and prove that the translation operator to the i’th node is invertible if and only if all eigenvectors ar...
متن کاملRealizations of Causal Manifolds by Quantum Fields
Quantum mechanical operators and quantum fields are interpreted as realizations of timespace manifolds. Such causal manifolds are parametrized by the classes of the positive unitary operations in all complex operations, i.e. by the homogenous spaces D(n) = GL( I CnIR)/U(n) with n = 1 for mechanics and n = 2 for relativistic fields. The rank n gives the number of both the discrete and continuous...
متن کاملOld and new results on algebraic connectivity of graphs
This paper is a survey of the second smallest eigenvalue of the Laplacian of a graph G, best-known as the algebraic connectivity of G, denoted a(G). Emphasis is given on classifications of bounds to algebraic connectivity as a function of other graph invariants, as well as the applications of Fiedler vectors (eigenvectors related to a(G)) on trees, on hard problems in graphs and also on the com...
متن کاملThe inuence of Miroslav Fiedler on spectral graph theory
This note is a write up of a talk given at the ILAS meeting in Braunschweig, 2011, at the minisymposium celebrating the 80th birthday of Miroslav Fiedler. The purpose of the talk is to outline the impact of Fiedlers work on the development of spectral graph theory. Fiedler is best known for putting forward the algebraic connectivity and its eigenvector. These two topics were genuine gold strik...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 38 شماره
صفحات -
تاریخ انتشار 2010